On a minimum cycle basis of a graph
نویسندگان
چکیده
منابع مشابه
SIMULATED ANNEALING ALGORITHM FOR SELECTING SUBOPTIMAL CYCLE BASIS OF A GRAPH
The cycle basis of a graph arises in a wide range of engineering problems and has a variety of applications. Minimal and optimal cycle bases reduce the time and memory required for most of such applications. One of the important applications of cycle basis in civil engineering is its use in the force method to frame analysis to generate sparse flexibility matrices, which is needed for optimal a...
متن کاملAn Õ(m2n) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph
We consider the problem of computing a minimum cycle basis in a directed graph G. The input to this problem is a directed graph whose arcs have positive weights. In this problem a 1 0 1 incidence vector is associated with each cycle and the vector space over generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. ...
متن کاملMinimum Cycle Basis and All-Pairs Min Cut of a Planar Graph in Subquadratic Time
A minimum cycle basis of a weighted undirected graph G is a basis of the cycle space of G such that the total weight of the cycles in this basis is minimized. If G is a planar graph with non-negative edge weights, such a basis can be found in O(n2) time and space, where n is the size of G. We show that this is optimal if an explicit representation of the basis is required. We then present an O(...
متن کاملa head parameter survey on mazandarani dialect and its effect(s) on learning english from ca perspective (on the basis of x-bar syntax)1
there has been a gradual shift of focus from the study of rule systems, which have increasingly been regarded as impoverished, … to the study of systems of principles, which appear to occupy a much more central position in determining the character and variety of possible human languages. there is a set of absolute universals, notions and principles existing in ug which do not vary from one ...
15 صفحه اولUnion of all the Minimum Cycle Bases of a Graph
The perception of cyclic structures is a crucial step in the analysis of graphs. To describe the cycle vector space of a graph, a minimum cycle basis can be computed in polynomial time using an algorithm of Horton, 1987]. But the set of cycles corresponding to a minimum basis is not always relevant for analyzing the cyclic structure of a graph. This restriction is due to the fact that a minimum...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicationes Mathematicae
سال: 1980
ISSN: 1233-7234,1730-6280
DOI: 10.4064/am-16-4-631-639